package com.atguigu.linkedlist;

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
/**
 * 反转链表
 */
class ReverseLinkedList {
    public ListNode reverseList(ListNode head) {
        ListNode pre = null ;
        ListNode cur = head ;
        ListNode tmp = null ;
        while (cur != null) {
            tmp = cur.next ;
            cur.next = pre ;
            pre = cur ;
            cur = tmp ;
        }
        return pre ;
    }
}